Application of the Central Encryption System in the Dynamic Secret Sharing Scheme (II)

نویسندگان

  • Yulian Shang
  • Min Feng
  • Peng Li
  • Kaiquan Shi
چکیده

In 1979, Shamir and Blakley independently proposed the concept of secret key decentralization (Shamir, A, 1979, P.612-613 & Backly, G. R, 1979), and the mechanism implementing this idea was called as the (t, n)-threshold scheme. In two schemes, one secret key (the secret key of the system) was divided into n parts (n sub-secret keys) respectively kept by n persons, and for certain integer t(t<n), it fulfills (1) in these n persons, any r ) ( t r  persons could cooperate to recovery the private key of the system; (2) any r ) ( t r  persons could offer little help to recovery the private key of the system. This idea of private key decentralization makes the private key management more safe and flexible. After the idea of the (t, n)-threshold was proposed, many scholars proposed many schemes to implement it. At present, except of the management of secret key, it has been applied in other domains of cryptology such as signature and group attestation (Du, 2009, P.21-23).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

متن کامل

Computationally secure multiple secret sharing: models, schemes, and formal security analysis

A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...

متن کامل

An Efficient Secret Sharing-based Storage System for Cloud-based Internet of Things

Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...

متن کامل

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

Security Analysis of a Hash-Based Secret Sharing Scheme

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer and Information Science

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2010